Average Brain Models: A Convergence Study

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Average Brain Models: A Convergence Study

We present a completely automatic method to build stablee average anatomical models of the human brain using a set of magnetic resonance (MR) images. The models computed present two important characteristics: an average intensity and an average shape, both in a single image. We provide results showing convergence toward the centroid of the image set used for the computation of the model. In par...

متن کامل

Automatic Computation of Average Brain Models

We present a completely automatic method to build average anatomical models of the human brain using a set of MR images. The models computed present two important characteristics: an average intensity and an average shape. We provide results showing convergence toward the barycenter of the image set used for the computation of the model.

متن کامل

Multi-Agent Average Convergence

Let I = [0, N − 1] denote the set of indices. We define the set of states S to contain all maps of type I → R for fixed positive N ∈ N (representing the number of agents). For each s ∈ S, i ∈ I, s(i) represents the value held by the agent with ID i. We denote the arbitrarily fixed start state s0. We introduce the function g whose domain MR is the set of non-empty finite multisets of real number...

متن کامل

a study on thermodynamic models for simulation of 1,3 butadiene purification columns

attempts have been made to study the thermodynamic behavior of 1,3 butadiene purification columns with the aim of retrofitting those columns to more energy efficient separation schemes. 1,3 butadiene is purified in two columns in series through being separated from methyl acetylene and 1,2 butadiene in the first and second column respectively. comparisons have been made among different therm...

On the convergence of weighted-average consensus

In this note we give sufficient conditions for the convergence of the iterative algorithm called weighted-average consensus in directed graphs. We study the discrete-time form of this algorithm. We use standard techniques from matrix theory to prove the main result. As a particular case one can obtain well-known results for non-weighted average consensus. We also give a corollary for undirected...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Vision and Image Understanding

سال: 2000

ISSN: 1077-3142

DOI: 10.1006/cviu.1999.0815